Complexity of edge monitoring on some graph classes
نویسندگان
چکیده
In this paper, we study the complexity of edge monitoring problem. A vertex v monitors an e if both endpoints together with form a triangle in graph. Given graph G=(V,E) and weight function on edges c where c(e) is number that needs e, problem to seek minimum subset S such every monitored by at least vertices S. Therefore, several classes as complete graphs, block cographs, split interval graphs planar graphs. We also generalize adding weights vertices.
منابع مشابه
Complexity of Edge Monitoring on Some Graph Classes
In this paper, we study the complexity of the edge monitoring problem. A vertex v monitors an edge e if both extremities together with v form a triangle in the graph. Given a graph G = (V,E) and a weight function on edges c where c(e) is the number of monitors that needs the edge e, the problem is to seek a minimum subset of monitors S such that every edge e in the graph is monitored by at leas...
متن کاملThe edge C4 graph of some graph classes
The edge C4 graph of a graph G, E4(G) is a graph whose vertices are the edges of G and two vertices in E4(G) are adjacent if the corresponding edges in G are either incident or are opposite edges of some C4. In this paper, we show that there exist infinitely many pairs of non isomorphic graphs whose edge C4 graphs are isomorphic. We study the relationship between the diameter, radius and domina...
متن کاملthe impact of attending efl classes on the level of depression of iranian female learners and their attributional complexity
می توان گفت واقعیت چند لایه ا ی کلاس های زبان انگلیسی بسیار حائز اهمیت است، زیرا عواطف و بینش های زبان آموزان تحت تاثیر قرار می گیرد. در پژوهش پیش رو، گفته می شود که دبیران با در پیش گرفتن رویکرد فرا-انسانگرایی ، قادرند در زندگی دانش آموزانشان نقش مهمی را ایفا سازند. بر اساس گفته ی ویلیامز و بردن (2000)، برای کرل راجرز، یکی از بنیان گذاران رویکرد انسانگرایی ، یادگیری بر مبنای تجربه، نوعی از یاد...
Some graph classes satisfying acyclic edge colouring conjecture
We present some classes of graphs which satisfy the acyclic edge colouring conjecture which states that any graph can be acyclically edge coloured with at most ∆ + 2 colours.
متن کاملOn the complexity of the selective graph coloring problem in some special classes of graphs
In this paper, we consider the selective graph coloring problem. Given an integer k ≥ 1 and a graph G = (V,E) with a partition V1, . . . , Vp of V , it consists in deciding whether there exists a set V ∗ in G such that ∣V ∗ ∩ Vi∣ = 1 for all i ∈ {1, . . . , p}, and such that the graph induced by V ∗ is k-colorable. We investigate the complexity status of this problem in various classes of graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2022
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2022.06.014